Reimer's Inequality on a Finite Distributive Lattice
نویسنده
چکیده
We generalize Reimer’s Inequality [6] (a.k.a the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices. (MSC 60C05)
منابع مشابه
On the Number of Join-irreducibles in a Congruence Representation of a Finite Distributive Lattice
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows: Theorem. Let E be a quasi-ordering on a finite set P . Then the following conditions are equivalent: (i) There exists a finite lattice L such that 〈J(L),EL〉 is iso...
متن کاملAn inequality for the sizes of prime filters of finite distributive lattices
Let L be a finite distributive lattice, and let J(L) denote the set of all join-irreducible elements of L. Set j (L) = IJ(Z)l. For each a C J(L), let u(a) denote the number of elements in the prime filter {x C L: x >~a}. Our main theorem is Theorem 1. For any finite distributive lattice L, 4 "(a) ~>j(L)41q ,'2. aEJ(L) The base 4 here can most likely be replaced by a smaller number, but it canno...
متن کاملComputing Congruence Lattices of Finite Lattices
An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n2 log2 n), where n = |L|. This paper is motivated by the problem of efficiently calculating and representing the congruence lattice Con L of a finite lattice L. Of c...
متن کاملFUZZY ORDERED SETS AND DUALITY FOR FINITE FUZZY DISTRIBUTIVE LATTICES
The starting point of this paper is given by Priestley’s papers, where a theory of representation of distributive lattices is presented. The purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. In this way, some results of Priestley’s papers are extended. In the main theorem, we show that the category of finite fuzzy Priestley space...
متن کاملCovering in the Lattice of Subuniverses of a Finite Distributive Lattice
The covering relation in the lattice of subuniverses of a finite distributive lattice is characterized in terms of how new elements in a covering sublattice fit with the sublattice covered. In general, although the lattice of subuniverses of a finite distributive lattice will not be modular, nevertheless we are able to show that certain instances of Dedekind’s Transposition Principle still hold...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 22 شماره
صفحات -
تاریخ انتشار 2013